Search results for "vertex [decay]"
showing 10 items of 31 documents
Miscellaneous Graph Preliminaries
2020
Summary This article contains many auxiliary theorems which were missing in the Mizar Mathematical Library [2] to the best of the author’s knowledge. Most of them regard graph theory as formalized in the GLIB series (cf. [8]) and most of them are preliminaries needed in [7] or other forthcoming articles.
Measurement of the lifetime of tau-lepton
1996
The tau lepton lifetime is measured with the L3 detector at LEP using the complete data taken at centre-of-mass energies around the Z pole resulting in tau_tau = 293.2 +/- 2.0 (stat) +/- 1.5 (syst) fs. The comparison of this result with the muon lifetime supports lepton universality of the weak charged current at the level of six per mille. Assuming lepton universality, the value of the strong coupling constant, alpha_s is found to be alpha_s(m_tau^2) = 0.319 +/- 0.015(exp.) +/- 0.014 (theory). The tau lepton lifetime is measured with the L3 detector at LEP using the complete data taken at centre-of-mass energies around the Z pole resulting in τ τ =293.2 ± 2.0 (stat) ± 1.5 (syst) fs . The c…
The Linear Ordering Polytope
2010
So far we developed a general integer programming approach for solving the LOP. It was based on the canonical IP formulation with equations and 3-dicycle inequalities which was then strengthened by generating mod-k-inequalities as cutting planes. In this chapter we will add further ingredients by looking for problem- specific inequalities. To this end we will study the convex hull of feasible solutions of the LOP: the so-called linear ordering polytope.
Refined Finiteness and Degree Properties in Graphs
2020
Summary In this article the finiteness of graphs is refined and the minimal and maximal degree of graphs are formalized in the Mizar system [3], based on the formalization of graphs in [4].
Polyhedral results for a vehicle routing problem
1991
Abstract The Vehicle Routing Problem is a well known, and hard, combinatorial problem, whose polyhedral structure has deserved little attention. In this paper we consider the particular case in which all the demands are equal (since in the general case the associated polytope may be empty). From a known formulation of the problem we obtain the dimension of the corresponding polytope and we study the facetial properties of every inequality in it.
On the hardness of optimization in power-law graphs
2008
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks appear to exhibit a power-law distribution: the number of nodes y"i of a given degree i is proportional to i^-^@b where @b>0 is a constant that depends on the application domain. There is practical evidence that combinatorial optimization in power-law graphs is easier than in general graphs, prompting the basic theoretical question: Is combinatorial optimization in power-law graphs easy? Does the answer depend on the power-law exponent @b? Our main result is the proof that many classical NP-hard graph-theoretic optimizati…
Constrained Role Mining
2013
Role Based Access Control (RBAC) is a very popular access control model, for long time investigated and widely deployed in the security architecture of different enterprises. To implement RBAC, roles have to be firstly identified within the considered organization. Usually the process of (automatically) defining the roles in a bottom up way, starting from the permissions assigned to each user, is called {\it role mining}. In literature, the role mining problem has been formally analyzed and several techniques have been proposed in order to obtain a set of valid roles. Recently, the problem of defining different kind of constraints on the number and the size of the roles included in the resu…
FIRST experiment: Fragmentation of Ions Relevant for Space and Therapy
2013
International audience; Nuclear fragmentation processes are relevant in different fields of basic research and applied physics and are of particular interest for tumor therapy and for space radiation protection applications. The FIRST (Fragmentation of Ions Relevant for Space and Therapy) experiment at SIS accelerator of GSI laboratory in Darmstadt, has been designed for the measurement of different ions fragmentation cross sections at different energies between 100 and 1000 MeV/nucleon. The experiment is performed by an international collaboration made of institutions from Germany, France, Italy and Spain. The experimental apparatus is partly based on an already existing setup made of the …
Variable Neighborhood Search for the Vertex Separation Problem
2012
The vertex separation problem belongs to a family of optimization problems in which the objective is to nd the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or the Interval Thickness, among others. All of these optimization problems are NP-hard and have practical applications in VLSI, computer language compiler design or graph drawing. Up to know, they have been generally tackled with exact approaches, presenting polynomial-time algorithms to obtain the optimal solution for speci c types of graphs. However, in spite of their practical applications, these…
A Precise Measurement of the Tau Lepton Lifetime
1996
The tau lepton lifetime has been measured using three different methods with the DELPHI detector. Two measurements of one-prong decays are combined, accounting for correlations, giving a result of \tau_\tau = 291.8 \pm 3.3 \mbox{ (stat.)} \pm 2.0 \mbox{(sys.) fs} while the decay length distribution of three-prong decays gives the result \tau_{\tau} = 286.7 \pm 4.9 \mbox{ (stat.)} \pm 3.3 \mbox{ (sys.) fs}. Combining the results presented here with previous DELPHI measurements, we get \tau_{\tau} = 291.4 \pm 3.0 fs and find that the ratio of the coupling constant for tau decay relative to that for muon decay is 0.990 \pm 0.009, compatible with lepton universality.